Fast Layout Methods for Timetable Graphs
نویسندگان
چکیده
In this paper, we present a fast layout algorithm using an entirely different approa h to edge routing, based on dire tions of ontrol segments rather than positions of ontrol points. We reveal an interesting theoreti al onne tion with Tutte's bary entri layout method [18℄, and our omputational studies show that this new approa h yields satisfa tory layouts even for huge timetable graphs within se onds.
منابع مشابه
Experimental Study on Speed-Up Techniques for Timetable Information Systems
During the last years, impressive speed-up techniques for DIJKSTRA’s algorithm have been developed. Unfortunately, recent research mainly focused on road networks. However, fast algorithms are also needed for other applications like timetable information systems. Even worse, the adaption of recently developed techniques to timetable information is more complicated than expected. In this work, w...
متن کاملMaintenance of Multi-level Overlay Graphs for Timetable Queries
In railways systems the timetable is typically represented as a weighted digraph on which itinerary queries are answered by shortest path algorithms, usually running Dijkstra’s algorithm. Due to the continuously growing size of real-world graphs, there is a constant need for faster algorithms and many techniques have been devised to heuristically speed up Dijkstra’s algorithm. One of these tech...
متن کاملExperimental study of speed up techniques for timetable information systems
In recent years, many speed-up techniques for DIJKSTRA’s algorithm have been developed. Unfortunately, research mainly focused on road networks although fast algorithms are also needed for other applications like timetable information systems. Even worse, the adaption of recently developed techniques to graphs deriving from timetable information problems is often more complicated than expected....
متن کاملNeighborhood beautification Graph layout through message passing
Graph layout algorithms are used to compute aesthetic and useful visualizations of graphs. In general, for graphs with up to a few hundred nodes, force-directed layout algorithms produce good layouts. Unfortunately, for larger graphs, they often get stuck at local minima and have high computational complexity. In this paper, we introduce a novel message passing technique for graph layout. The k...
متن کاملGraph Layout for Applications in Compiler Construction
We address graph visualization from the viewpoint of com piler construction Most data structures in compilers are large dense graphs such as annotated control ow graph syntax trees dependency graphs Our main focus is the animation and interactive exploration of these graphs Fast layout heuristics and powerful browsing methods are needed We give a survey of layout heuristics for general directed...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000